A 3/4 Differential Approximation Algorithm for Traveling Salesman Problem
نویسندگان
چکیده
In this paper, we consider differential approximability of the traveling salesman problem (TSP). The approximation ratio was proposed by Demange and Paschos in 1996 as an criterion that is invariant under affine transformation objective function. We show TSP 3/4-differential approximable, which improves currently best known bound $$3/4 -O(1/n)$$ due to Escoffier Monnot 2008, where n denotes number vertices given graph.
منابع مشابه
An Approximation Algorithm for a Bottleneck Traveling Salesman Problem
Consider a truck running along a road. It picks up a load Li at point βi and delivers it at αi, carrying at most one load at a time. The speed on the various parts of the road in one direction is given by f(x) and that in the other direction is given by g(x). Minimizing the total time spent to deliver loads L1, . . . , Ln is equivalent to solving the Traveling Salesman Problem (TSP) where the c...
متن کاملDifferential approximation results for the traveling salesman problem with distances
We prove that both minimum and maximum traveling salesman problems on complete graphs with edge-distances 1 and 2 (denoted by min TSP12 and max TSP12, respectively) are approximable within 3/4. Based upon this result, we improve the standard approximation ratio known for maximum traveling salesman with distances 1 and 2 from 3/4 to 7/8. Finally, we prove that, for any 2 > 0, it is NP-hard to ap...
متن کاملAn Approximation Algorithm for the Maximum Traveling Salesman Problem
We develop a polynomial time approximation algorithm for the maximum traveling salesman problem. It guarantees a solution value of at least r times the optimal one for any given r < 5 7 .
متن کاملAn Approximation Algorithm for the Curvature-Constrained Traveling Salesman Problem
We present an approximation algorithm for the Traveling Salesman Problem when the vehicle is constrained to move forward along paths with bounded curvature (Dubins’ vehicle). A deterministic algorithm returns in time O(n3) a tour within (( 1 + max { 8πρ Dmin , 14 3 }) log n ) of the optimum tour, where n is the number of points to visit, ρ is the minimum turning radius and Dmin is the minimum E...
متن کاملApproximation algorithms for the traveling salesman problem
We first prove that the minimum and maximum traveling salesman problems, their metric versions as well as some versions defined on parameterized triangle inequalities (called sharpened and relaxed metric traveling salesman) are all equi-approximable under an approximation measure, called differential-approximation ratio, that measures how the value of an approximate solution is placed in the in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Lecture Notes in Computer Science
سال: 2022
ISSN: ['1611-3349', '0302-9743']
DOI: https://doi.org/10.1007/978-3-031-20350-3_19